Pure adaptive search in monte carlo optimization
نویسندگان
چکیده
منابع مشابه
Pure adaptive search in global optimization
Pure adaptive seach iteratively constructs a sequence of interior points uniformly distributed within the corresponding sequence of nested improving regions of the feasible space. Tbat is, at any iteration, the hext point in the sequence is uniformly distributed over the region of feasible space containing all points that are strictly superior in value to the previous points in the sequence. Th...
متن کاملPure adaptive search for finite global optimization
Pure Adaptive Search is a stochastic algorithm which has been analyzed for continuous global optimization. When a unifonn distribution is used in PAS. it has been shown to have complexity which is linear in dimension. We define strong and weak variations of PAS in the setting of finite global optimization and prove analogous results. In particular, for the n-dimensional lattice {t, ... ,k}n, th...
متن کاملNested Monte-Carlo Search
Many problems have a huge state space and no good heuristic to order moves so as to guide the search toward the best positions. Random games can be used to score positions and evaluate their interest. Random games can also be improved using random games to choose a move to try at each step of a game. Nested Monte-Carlo Search addresses the problem of guiding the search toward better states when...
متن کاملImproved Monte-Carlo Search
Monte-Carlo search has been successful in many non-deterministic games, and recently in deterministic games with high branching factor. One of the drawbacks of the current approaches is that even if the iterative process would last for a very long time, the selected move does not necessarily converge to a game-theoretic optimal one. In this paper we introduce a new algorithm, UCT, which extends...
متن کاملMonte-Carlo Tree Search
representation of the game. It was programmed in LISP. Further use of abstraction was also studied by Friedenbach (1980). The combination of search, heuristics, and expert systems led to the best programs in the eighties. At the end of the eighties a new type of Go programs emerged. These programs made an intensive use of pattern recognition. This approach was discussed in detail by Boon (1990)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1989
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01582296